Exact Tensor Completion Using t-SVD
نویسندگان
چکیده
منابع مشابه
Exact tensor completion with sum-of-squares
We obtain the first polynomial-time algorithm for exact tensor completion that improves over the bound implied by reduction to matrix completion. The algorithm recovers an unknown 3-tensor with r incoherent, orthogonal components in from r · Õ(n1.5) randomly observed entries of the tensor. This bound improves over the previous best one of r · Õ(n2) by reduction to exact matrix completion. Our...
متن کاملInterpolation using Hankel tensor completion
We present a novel multidimensional seismic trace interpolator that works on constant-frequency slices. It performs completion on Hankel tensors whose order is twice the number of spatial dimensions. Completion is done by fitting a PARAFAC model using an Alternating Least Squares algorithm. The new interpolator runs quickly and can better handle large gaps and high sparsity than existing comple...
متن کاملExact Tensor Completion from Sparsely Corrupted Observations via Convex Optimization
This paper conducts a rigorous analysis for provable estimation of multidimensional arrays, in particular third-order tensors, from a random subset of its corrupted entries. Our study rests heavily on a recently proposed tensor algebraic framework in which we can obtain tensor singular value decomposition (t-SVD) that is similar to the SVD for matrices, and define a new notion of tensor rank re...
متن کاملOn Polynomial Time Methods for Exact Low Rank Tensor Completion
In this paper, we investigate the sample size requirement for exact recovery of a high order tensor of low rank from a subset of its entries. We show that a gradient descent algorithm with initial value obtained from a spectral method can, in particular , reconstruct a d × d × d tensor of multilinear ranks (r, r, r) with high probability from as few as O(r 7/2 d 3/2 log 7/2 d + r 7 d log 6 d) e...
متن کاملTensor Completion
The purpose of this thesis is to explore the methods to solve the tensor completion problem. Inspired by the matrix completion problem, the tensor completion problem is formulated as an unconstrained nonlinear optimization problem, which finds three factors that give a low-rank approximation. Various of iterative methods, including the gradient-based methods, stochastic gradient descent method ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2017
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2016.2639466